A Parallel Biased Random-Key Genetic Algorithm with Multiple Populations Applied to Irregular Strip Packing Problems

Bound Smoothing with a Biased Random-Key Genetic Algorithm

In this work we solve a subproblem of the distance geometry problem in molecular conformation. The latter aims to determine the three-dimensional structure of a molecule from a set of imprecisely distances. We are interested only in the bound smoothing subproblem, which aims to tighten bounds from a set of lower and upper bounds on distance for pair of atoms. We apply a Biased Random-Key Geneti...

A Biased Random-key Genetic Algorithm for a 2d and 3d Bin Packing Problem

A Biased Random-key Genetic Algorithm for Job-shop Scheduling

This paper presents a local search, based on a new neighborhood for the job-shop scheduling problem, and its application within a biased random-key genetic algorithm. Schedules are constructed by decoding the chromosome supplied by the genetic algorithm with a procedure that generates active schedules. After an initial schedule is obtained, a local search heuristic, based on an extension of the...

A biased random-key genetic algorithm for road congestion minimization

One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment problem aims to minimize total travel delay among all travelers. Based on data derived from the first problem, the toll pricing problem determines the set of tolls and corresponding tariffs that would collectively benefit a...

A parallel multi-population biased random-key genetic algorithm for a container loading problem